منابع مشابه
Cut search methods in integer programming
Cut search is a new approach for solving integer programs based on extending edges of a cone to probe the solution space for sets of hyperplanes that are "proxies" for solution points in the space. Once all proxy hyperplanes associated with a given point have been intersected by at least one of the extended edges, this point is included in a set of points to be examined for feasibility (algorit...
متن کاملBranch-and-cut Algorithms for Integer Programming, Branch-and-cut
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...
متن کاملDecomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programming problems. Traditionally, these methods have been viewed as distinct from polyhedral methods, in which bounds are obtained by dynamically generating valid inequalities to strengthen a linear programming relaxation. ...
متن کاملDecomposition and Dynamic Cut Generation in Integer Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to develop bounds for integer programming problems. We draw connections between these classical approaches and techniques based on generating strong valid inequalities. We also discuss several methods for incorporating dynamic cut generation into traditional decompositi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1972
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01584977